0.08/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.11	% Command    : run_E %s %d THM
0.10/0.31	% Computer : n028.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 960
0.10/0.31	% WCLimit    : 120
0.10/0.31	% DateTime   : Tue Aug  9 06:17:20 EDT 2022
0.10/0.32	% CPUTime    : 
0.15/0.42	Running higher-order on 8 cores theorem proving
0.15/0.42	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.15/0.43	# Version: 3.0pre003-ho
1.30/0.67	# Preprocessing class: HSMSSMSSMLLNHSN.
1.30/0.67	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
1.30/0.67	# Starting new_ho_10_cnf2 with 600s (5) cores
1.30/0.67	# Starting post_as_ho3 with 120s (1) cores
1.30/0.67	# Starting new_ho_12 with 120s (1) cores
1.30/0.67	# Starting new_bool_2 with 120s (1) cores
1.30/0.67	# new_bool_2 with pid 31079 completed with status 8
1.30/0.67	# new_ho_12 with pid 31078 completed with status 0
1.30/0.67	# Result found by new_ho_12
1.30/0.67	# Preprocessing class: HSMSSMSSMLLNHSN.
1.30/0.67	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
1.30/0.67	# Starting new_ho_10_cnf2 with 600s (5) cores
1.30/0.67	# Starting post_as_ho3 with 120s (1) cores
1.30/0.67	# Starting new_ho_12 with 120s (1) cores
1.30/0.67	# No SInE strategy applied
1.30/0.67	# Search class: HGHNS-FFMF21-SHSSMFNN
1.30/0.67	# partial match(1): HGUNS-FFMF21-SHSSMFNN
1.30/0.67	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
1.30/0.67	# Starting new_ho_10 with 65s (1) cores
1.30/0.67	# new_ho_10 with pid 31083 completed with status 0
1.30/0.67	# Result found by new_ho_10
1.30/0.67	# Preprocessing class: HSMSSMSSMLLNHSN.
1.30/0.67	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
1.30/0.67	# Starting new_ho_10_cnf2 with 600s (5) cores
1.30/0.67	# Starting post_as_ho3 with 120s (1) cores
1.30/0.67	# Starting new_ho_12 with 120s (1) cores
1.30/0.67	# No SInE strategy applied
1.30/0.67	# Search class: HGHNS-FFMF21-SHSSMFNN
1.30/0.67	# partial match(1): HGUNS-FFMF21-SHSSMFNN
1.30/0.67	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
1.30/0.67	# Starting new_ho_10 with 65s (1) cores
1.30/0.67	# Preprocessing time       : 0.002 s
1.30/0.67	# Presaturation interreduction done
1.30/0.67	
1.30/0.67	# Proof found!
1.30/0.67	# SZS status Theorem
1.30/0.67	# SZS output start CNFRefutation
1.30/0.67	thf(decl_22, type, mrel: mworld > mworld > $o).
1.30/0.67	thf(decl_23, type, mactual: mworld).
1.30/0.67	thf(decl_24, type, mlocal: (mworld > $o) > $o).
1.30/0.67	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_32, type, mforall_di: ($i > mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_33, type, mexists_di: ($i > mworld > $o) > mworld > $o).
1.30/0.67	thf(decl_34, type, empty_set: $i).
1.30/0.67	thf(decl_35, type, qmltpeq: $i > $i > mworld > $o).
1.30/0.67	thf(decl_36, type, equal_set: $i > $i > mworld > $o).
1.30/0.67	thf(decl_37, type, member: $i > $i > mworld > $o).
1.30/0.67	thf(decl_38, type, subset: $i > $i > mworld > $o).
1.30/0.67	thf(decl_39, type, singleton: $i > $i).
1.30/0.67	thf(decl_40, type, product: $i > $i).
1.30/0.67	thf(decl_41, type, unordered_pair: $i > $i > $i).
1.30/0.67	thf(decl_42, type, intersection: $i > $i > $i).
1.30/0.67	thf(decl_43, type, difference: $i > $i > $i).
1.30/0.67	thf(decl_44, type, sum: $i > $i).
1.30/0.67	thf(decl_45, type, union: $i > $i > $i).
1.30/0.67	thf(decl_46, type, power_set: $i > $i).
1.30/0.67	thf(decl_47, type, esk1_2: $i > $i > $i).
1.30/0.67	thf(decl_48, type, esk2_2: $i > $i > $i).
1.30/0.67	thf(decl_49, type, esk3_0: $i).
1.30/0.67	thf(decl_50, type, esk4_0: $i).
1.30/0.67	thf(decl_51, type, esk5_2: $i > $i > $i).
1.30/0.67	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mlocal_def)).
1.30/0.67	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mimplies_def)).
1.30/0.67	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mequiv_def)).
1.30/0.67	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:((X6 @ X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mforall_di_def)).
1.30/0.67	thf(mand_def, axiom, ((mand)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)&(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mand_def)).
1.30/0.67	thf(subset_0, axiom, (mlocal @ (mforall_di @ (^[X55:$i]:(mforall_di @ (^[X56:$i]:(mequiv @ (subset @ X55 @ X56) @ (mforall_di @ (^[X7:$i]:(mimplies @ (member @ X7 @ X55) @ (member @ X7 @ X56)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', subset_0)).
1.30/0.67	thf(intersection_0, axiom, (mlocal @ (mforall_di @ (^[X7:$i]:(mforall_di @ (^[X30:$i]:(mforall_di @ (^[X31:$i]:(mequiv @ (member @ X7 @ (intersection @ X30 @ X31)) @ (mand @ (member @ X7 @ X30) @ (member @ X7 @ X31)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', intersection_0)).
1.30/0.67	thf(thI06, conjecture, (mlocal @ (mforall_di @ (^[X44:$i]:(mforall_di @ (^[X45:$i]:(equal_set @ (intersection @ X44 @ X45) @ (intersection @ X45 @ X44))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thI06)).
1.30/0.67	thf(equal_set_0, axiom, (mlocal @ (mforall_di @ (^[X28:$i]:(mforall_di @ (^[X29:$i]:(mequiv @ (equal_set @ X28 @ X29) @ (mand @ (subset @ X28 @ X29) @ (subset @ X29 @ X28)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', equal_set_0)).
1.30/0.67	thf(c_0_9, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
1.30/0.67	thf(c_0_10, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
1.30/0.67	thf(c_0_11, plain, ((mequiv)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
1.30/0.67	thf(c_0_12, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
1.30/0.67	thf(c_0_13, plain, ((mand)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand_def])).
1.30/0.67	thf(c_0_14, plain, ![X142:$i, X141:$i]:(((subset @ X142 @ X141 @ mactual)<=>![X140:$i]:(((member @ X140 @ X142 @ mactual)=>(member @ X140 @ X141 @ mactual))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_0]), c_0_9]), c_0_10]), c_0_11]), c_0_12])).
1.30/0.67	thf(c_0_15, plain, ![X106:$i, X105:$i, X104:$i]:(((member @ X106 @ (intersection @ X105 @ X104) @ mactual)<=>((member @ X106 @ X105 @ mactual)&(member @ X106 @ X104 @ mactual)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[intersection_0]), c_0_9]), c_0_13]), c_0_11]), c_0_12])).
1.30/0.67	thf(c_0_16, plain, ![X233:$i, X234:$i, X235:$i, X236:$i, X237:$i]:(((~(subset @ X233 @ X234 @ mactual)|(~(member @ X235 @ X233 @ mactual)|(member @ X235 @ X234 @ mactual)))&(((member @ (esk5_2 @ X236 @ X237) @ X236 @ mactual)|(subset @ X236 @ X237 @ mactual))&(~(member @ (esk5_2 @ X236 @ X237) @ X237 @ mactual)|(subset @ X236 @ X237 @ mactual))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])])).
1.30/0.67	thf(c_0_17, plain, ![X194:$i, X195:$i, X196:$i]:(((((member @ X194 @ X195 @ mactual)|~(member @ X194 @ (intersection @ X195 @ X196) @ mactual))&((member @ X194 @ X196 @ mactual)|~(member @ X194 @ (intersection @ X195 @ X196) @ mactual)))&(~(member @ X194 @ X195 @ mactual)|~(member @ X194 @ X196 @ mactual)|(member @ X194 @ (intersection @ X195 @ X196) @ mactual)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
1.30/0.67	thf(c_0_18, negated_conjecture, ~(![X126:$i, X125:$i]:((equal_set @ (intersection @ X126 @ X125) @ (intersection @ X125 @ X126) @ mactual))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thI06])]), c_0_9]), c_0_12])).
1.30/0.67	thf(c_0_19, plain, ![X103:$i, X102:$i]:(((equal_set @ X103 @ X102 @ mactual)<=>((subset @ X103 @ X102 @ mactual)&(subset @ X102 @ X103 @ mactual)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[equal_set_0]), c_0_9]), c_0_13]), c_0_11]), c_0_12])).
1.30/0.67	thf(c_0_20, plain, ![X7:$i, X9:$i]:(((subset @ X7 @ X9 @ mactual)|~((member @ (esk5_2 @ X7 @ X9) @ X9 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_16])).
1.30/0.67	thf(c_0_21, plain, ![X7:$i, X9:$i, X10:$i]:(((member @ X7 @ (intersection @ X9 @ X10) @ mactual)|~((member @ X7 @ X9 @ mactual))|~((member @ X7 @ X10 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_17])).
1.30/0.67	thf(c_0_22, plain, ![X7:$i, X9:$i, X10:$i]:(((member @ X7 @ X9 @ mactual)|~((member @ X7 @ (intersection @ X9 @ X10) @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_17])).
1.30/0.67	thf(c_0_23, plain, ![X7:$i, X9:$i]:(((member @ (esk5_2 @ X7 @ X9) @ X7 @ mactual)|(subset @ X7 @ X9 @ mactual))), inference(split_conjunct,[status(thm)],[c_0_16])).
1.30/0.67	thf(c_0_24, negated_conjecture, ~(equal_set @ (intersection @ esk3_0 @ esk4_0) @ (intersection @ esk4_0 @ esk3_0) @ mactual), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])).
1.30/0.67	thf(c_0_25, plain, ![X192:$i, X193:$i]:(((((subset @ X192 @ X193 @ mactual)|~(equal_set @ X192 @ X193 @ mactual))&((subset @ X193 @ X192 @ mactual)|~(equal_set @ X192 @ X193 @ mactual)))&(~(subset @ X192 @ X193 @ mactual)|~(subset @ X193 @ X192 @ mactual)|(equal_set @ X192 @ X193 @ mactual)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])).
1.30/0.67	thf(c_0_26, plain, ![X7:$i, X10:$i, X9:$i]:(((subset @ X7 @ (intersection @ X9 @ X10) @ mactual)|~((member @ (esk5_2 @ X7 @ (intersection @ X9 @ X10)) @ X10 @ mactual))|~((member @ (esk5_2 @ X7 @ (intersection @ X9 @ X10)) @ X9 @ mactual)))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
1.30/0.67	thf(c_0_27, plain, ![X7:$i, X9:$i, X10:$i]:(((member @ (esk5_2 @ (intersection @ X7 @ X9) @ X10) @ X7 @ mactual)|(subset @ (intersection @ X7 @ X9) @ X10 @ mactual))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
1.30/0.67	thf(c_0_28, plain, ![X7:$i, X10:$i, X9:$i]:(((member @ X7 @ X9 @ mactual)|~((member @ X7 @ (intersection @ X10 @ X9) @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_17])).
1.30/0.67	thf(c_0_29, negated_conjecture, ~((equal_set @ (intersection @ esk3_0 @ esk4_0) @ (intersection @ esk4_0 @ esk3_0) @ mactual)), inference(split_conjunct,[status(thm)],[c_0_24])).
1.30/0.67	thf(c_0_30, plain, ![X9:$i, X7:$i]:(((equal_set @ X7 @ X9 @ mactual)|~((subset @ X7 @ X9 @ mactual))|~((subset @ X9 @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_25])).
1.30/0.67	thf(c_0_31, plain, ![X7:$i, X9:$i, X10:$i]:(((subset @ (intersection @ X7 @ X9) @ (intersection @ X10 @ X7) @ mactual)|~((member @ (esk5_2 @ (intersection @ X7 @ X9) @ (intersection @ X10 @ X7)) @ X10 @ mactual)))), inference(spm,[status(thm)],[c_0_26, c_0_27])).
1.30/0.67	thf(c_0_32, plain, ![X7:$i, X9:$i, X10:$i]:(((member @ (esk5_2 @ (intersection @ X7 @ X9) @ X10) @ X9 @ mactual)|(subset @ (intersection @ X7 @ X9) @ X10 @ mactual))), inference(spm,[status(thm)],[c_0_28, c_0_23])).
1.30/0.67	thf(c_0_33, negated_conjecture, (~((subset @ (intersection @ esk4_0 @ esk3_0) @ (intersection @ esk3_0 @ esk4_0) @ mactual))|~((subset @ (intersection @ esk3_0 @ esk4_0) @ (intersection @ esk4_0 @ esk3_0) @ mactual))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
1.30/0.67	thf(c_0_34, plain, ![X9:$i, X7:$i]:((subset @ (intersection @ X7 @ X9) @ (intersection @ X9 @ X7) @ mactual)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
1.30/0.67	thf(c_0_35, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_34]), c_0_34])]), ['proof']).
1.30/0.67	# SZS output end CNFRefutation
1.30/0.67	# Parsed axioms                        : 71
1.30/0.67	# Removed by relevancy pruning/SinE    : 0
1.30/0.67	# Initial clauses                      : 79
1.30/0.67	# Removed in clause preprocessing      : 26
1.30/0.67	# Initial clauses in saturation        : 53
1.30/0.67	# Processed clauses                    : 898
1.30/0.67	# ...of these trivial                  : 9
1.30/0.67	# ...subsumed                          : 117
1.30/0.67	# ...remaining for further processing  : 772
1.30/0.67	# Other redundant clauses eliminated   : 0
1.30/0.67	# Clauses deleted for lack of memory   : 0
1.30/0.67	# Backward-subsumed                    : 0
1.30/0.67	# Backward-rewritten                   : 8
1.30/0.67	# Generated clauses                    : 12938
1.30/0.67	# ...of the previous two non-redundant : 10101
1.30/0.67	# ...aggressively subsumed             : 0
1.30/0.67	# Contextual simplify-reflections      : 0
1.30/0.67	# Paramodulations                      : 12928
1.30/0.67	# Factorizations                       : 10
1.30/0.67	# NegExts                              : 0
1.30/0.67	# Equation resolutions                 : 0
1.30/0.67	# Propositional unsat checks           : 0
1.30/0.67	#    Propositional check models        : 0
1.30/0.67	#    Propositional check unsatisfiable : 0
1.30/0.67	#    Propositional clauses             : 0
1.30/0.67	#    Propositional clauses after purity: 0
1.30/0.67	#    Propositional unsat core size     : 0
1.30/0.67	#    Propositional preprocessing time  : 0.000
1.30/0.67	#    Propositional encoding time       : 0.000
1.30/0.67	#    Propositional solver time         : 0.000
1.30/0.67	#    Success case prop preproc time    : 0.000
1.30/0.67	#    Success case prop encoding time   : 0.000
1.30/0.67	#    Success case prop solver time     : 0.000
1.30/0.67	# Current number of processed clauses  : 711
1.30/0.67	#    Positive orientable unit clauses  : 130
1.30/0.67	#    Positive unorientable unit clauses: 0
1.30/0.67	#    Negative unit clauses             : 112
1.30/0.67	#    Non-unit-clauses                  : 469
1.30/0.67	# Current number of unprocessed clauses: 9225
1.30/0.67	# ...number of literals in the above   : 23149
1.30/0.67	# Current number of archived formulas  : 0
1.30/0.67	# Current number of archived clauses   : 61
1.30/0.67	# Clause-clause subsumption calls (NU) : 18251
1.30/0.67	# Rec. Clause-clause subsumption calls : 15755
1.30/0.67	# Non-unit clause-clause subsumptions  : 26
1.30/0.67	# Unit Clause-clause subsumption calls : 11914
1.30/0.67	# Rewrite failures with RHS unbound    : 0
1.30/0.67	# BW rewrite match attempts            : 313
1.30/0.67	# BW rewrite match successes           : 9
1.30/0.67	# Condensation attempts                : 898
1.30/0.67	# Condensation successes               : 5
1.30/0.67	# Termbank termtop insertions          : 189404
1.30/0.67	
1.30/0.67	# -------------------------------------------------
1.30/0.67	# User time                : 0.224 s
1.30/0.67	# System time              : 0.015 s
1.30/0.67	# Total time               : 0.240 s
1.30/0.67	# Maximum resident set size: 2624 pages
1.30/0.67	
1.30/0.67	# -------------------------------------------------
1.30/0.67	# User time                : 0.317 s
1.30/0.67	# System time              : 0.034 s
1.30/0.67	# Total time               : 0.350 s
1.30/0.67	# Maximum resident set size: 1836 pages
1.30/0.67	EOF